Distributed Approch Using NSGAII Algorithm to Solve the Dynamic Dial a Ride Problem

نویسنده

  • A. RADDAOUI
چکیده

THE DRP (dial a ride problem) consists on determining and planifiying the operated tours of vehicles in order to satisfy the user’s requests hoping to become origin’s points to destination’s points. The DRP is bind to NPdifficult problems, in order to solve it, many researchers have been used multi objective approached methods; actually our approach consists on reducing the number of vehicles, reducing the route’s time and increasing the customer’s number. In this paper, we propose our contribution which is a distributed approach based on a multi-agent system( made to decompose the problem and to model the heterogeneous vehicle), and an instance of the genetic algorithm (NSGAII). The process of the proposed approach is shown through an illustrative example. KeywordsDistributed GA NSGAII, Mutli-objectve Simulated Annealing Algorithm, DRP, Multi-objective algorithm, DRP, SMA.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Distributed Approach for resolving a Stochastic Dial a Ride Problem with NSGA II

Transportation on demand does not stop facilitating our daily life. In fact, for 40 years the research has contributed to the resolution of the Dial a Ride Problem to improve the service offered to customers. In this research, we contributed to the resolution of a Stochastic Dial a Ride Problem while consider four problems that may inhibit the proper functioning of service Transport on Demand ,...

متن کامل

A hybrid CS-SA intelligent approach to solve uncertain dynamic facility layout problems considering dependency of demands

This paper aims at proposing a quadratic assignment-based mathematical model to deal with the stochastic dynamic facility layout problem. In this problem, product demands are assumed to be dependent normally distributed random variables with known probability density function and covariance that change from period to period at random. To solve the proposed model, a novel hybrid intelligent algo...

متن کامل

Heuristics and Performance Metamodels for the Dynamic Dial-a-Ride Problem

Title of dissertation: HEURISTICS AND PERFORMANCE METAMODELS FOR THE DYNAMIC DIAL-A-RIDE PROBLEM Ying Luo, Doctor of Philosophy, 2006 Directed by: Professor Paul M. Schonfeld Department of Civil and Environmental Engineering Explicit performance models of a transit system are often very useful in facilitating system design, optimization, alternative comparison, and gaining insights into the sys...

متن کامل

A Memtic genetic algorithm for a redundancy allocation problem

Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy strategies for...

متن کامل

Multicast Routing in Wireless Sensor Networks: A Distributed Reinforcement Learning Approach

Wireless Sensor Networks (WSNs) are consist of independent distributed sensors with storing, processing, sensing and communication capabilities to monitor physical or environmental conditions. There are number of challenges in WSNs because of limitation of battery power, communications, computation and storage space. In the recent years, computational intelligence approaches such as evolutionar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013